<title>悠米</title><link href="http://hzoi.com/tomorrow.css" rel="stylesheet"><div class="ui existing segment"><pre><code><span class="pl-cp">#include</span><span class="pl-cpf">&lt;cstdio&gt;</span><span class="pl-cp"></span>
<span class="pl-cp">#include</span><span class="pl-cpf">&lt;cstring&gt;</span><span class="pl-cp"></span>
<span class="pl-cp">#include</span><span class="pl-cpf">&lt;queue&gt;</span><span class="pl-cp"></span>
<span class="pl-cp">#define N 4000005</span>
<span class="pl-cp">#define M 40000005</span>
<span class="pl-k">using</span> <span class="pl-k">namespace</span> <span class="pl-n">std</span><span class="pl-p">;</span>
<span class="pl-kt">int</span> <span class="pl-n">n</span><span class="pl-p">,</span><span class="pl-n">m</span><span class="pl-p">,</span><span class="pl-n">k</span><span class="pl-p">,</span><span class="pl-n">u</span><span class="pl-p">,</span><span class="pl-n">v</span><span class="pl-p">,</span><span class="pl-n">w</span><span class="pl-p">;</span>
<span class="pl-k">struct</span> <span class="pl-n">Edge</span><span class="pl-p">{</span>
    <span class="pl-kt">int</span> <span class="pl-n">next</span><span class="pl-p">,</span><span class="pl-n">to</span><span class="pl-p">,</span><span class="pl-n">dis</span><span class="pl-p">;</span>
<span class="pl-p">}</span><span class="pl-n">edge</span><span class="pl-p">[</span><span class="pl-n">M</span><span class="pl-o">&lt;&lt;</span><span class="pl-mi">1</span><span class="pl-p">];</span>
<span class="pl-kt">int</span> <span class="pl-n">cnt</span><span class="pl-o">=</span><span class="pl-mi">1</span><span class="pl-p">,</span><span class="pl-n">head</span><span class="pl-p">[</span><span class="pl-n">N</span><span class="pl-p">];</span>
<span class="pl-k">struct</span> <span class="pl-n">Node</span><span class="pl-p">{</span>
    <span class="pl-kt">int</span> <span class="pl-n">u</span><span class="pl-p">,</span><span class="pl-n">dis</span><span class="pl-p">;</span>
    <span class="pl-kt">bool</span> <span class="pl-k">operator</span> <span class="pl-o">&lt;</span> <span class="pl-p">(</span><span class="pl-k">const</span> <span class="pl-n">Node</span> <span class="pl-o">&amp;</span><span class="pl-n">a</span><span class="pl-p">)</span> <span class="pl-k">const</span><span class="pl-p">{</span>
        <span class="pl-k">return</span> <span class="pl-n">a</span><span class="pl-p">.</span><span class="pl-n">dis</span><span class="pl-o">&lt;</span><span class="pl-n">dis</span><span class="pl-p">;</span>
    <span class="pl-p">}</span>
    <span class="pl-n">Node</span><span class="pl-p">(</span><span class="pl-kt">int</span> <span class="pl-n">a</span><span class="pl-p">,</span><span class="pl-kt">int</span> <span class="pl-n">b</span><span class="pl-p">){</span>
        <span class="pl-n">u</span><span class="pl-o">=</span><span class="pl-n">a</span><span class="pl-p">;</span>
        <span class="pl-n">dis</span><span class="pl-o">=</span><span class="pl-n">b</span><span class="pl-p">;</span>
    <span class="pl-p">}</span>
<span class="pl-p">};</span>
<span class="pl-kt">void</span> <span class="pl-nf">add</span><span class="pl-p">(</span><span class="pl-kt">int</span> <span class="pl-n">from</span><span class="pl-p">,</span><span class="pl-kt">int</span> <span class="pl-n">to</span><span class="pl-p">,</span><span class="pl-kt">int</span> <span class="pl-n">dis</span><span class="pl-p">){</span>
    <span class="pl-n">edge</span><span class="pl-p">[</span><span class="pl-o">++</span><span class="pl-n">cnt</span><span class="pl-p">].</span><span class="pl-n">next</span><span class="pl-o">=</span><span class="pl-n">head</span><span class="pl-p">[</span><span class="pl-n">from</span><span class="pl-p">];</span>
    <span class="pl-n">edge</span><span class="pl-p">[</span><span class="pl-n">cnt</span><span class="pl-p">].</span><span class="pl-n">to</span><span class="pl-o">=</span><span class="pl-n">to</span><span class="pl-p">;</span>
    <span class="pl-n">edge</span><span class="pl-p">[</span><span class="pl-n">cnt</span><span class="pl-p">].</span><span class="pl-n">dis</span><span class="pl-o">=</span><span class="pl-n">dis</span><span class="pl-p">;</span>
    <span class="pl-n">head</span><span class="pl-p">[</span><span class="pl-n">from</span><span class="pl-p">]</span><span class="pl-o">=</span><span class="pl-n">cnt</span><span class="pl-p">;</span>
<span class="pl-p">}</span>
<span class="pl-kt">int</span> <span class="pl-n">dis</span><span class="pl-p">[</span><span class="pl-n">N</span><span class="pl-p">];</span>
<span class="pl-kt">bool</span> <span class="pl-n">vis</span><span class="pl-p">[</span><span class="pl-n">N</span><span class="pl-p">];</span>
<span class="pl-kt">void</span> <span class="pl-nf">Dijkstra</span><span class="pl-p">(</span><span class="pl-kt">int</span> <span class="pl-n">s</span><span class="pl-p">){</span>
    <span class="pl-n">memset</span><span class="pl-p">(</span><span class="pl-n">vis</span><span class="pl-p">,</span><span class="pl-mi">0</span><span class="pl-p">,</span><span class="pl-k">sizeof</span><span class="pl-p">(</span><span class="pl-n">vis</span><span class="pl-p">));</span>
    <span class="pl-n">memset</span><span class="pl-p">(</span><span class="pl-n">dis</span><span class="pl-p">,</span><span class="pl-mh">0x3f</span><span class="pl-p">,</span><span class="pl-k">sizeof</span><span class="pl-p">(</span><span class="pl-n">dis</span><span class="pl-p">));</span>
    <span class="pl-n">priority_queue</span><span class="pl-o">&lt;</span><span class="pl-n">Node</span><span class="pl-o">&gt;</span> <span class="pl-n">q</span><span class="pl-p">;</span>
    <span class="pl-n">q</span><span class="pl-p">.</span><span class="pl-n">push</span><span class="pl-p">(</span><span class="pl-n">Node</span><span class="pl-p">(</span><span class="pl-n">s</span><span class="pl-p">,</span><span class="pl-mi">0</span><span class="pl-p">));</span>
    <span class="pl-n">dis</span><span class="pl-p">[</span><span class="pl-n">s</span><span class="pl-p">]</span><span class="pl-o">=</span><span class="pl-mi">0</span><span class="pl-p">;</span>
    <span class="pl-k">while</span><span class="pl-p">(</span><span class="pl-o">!</span><span class="pl-n">q</span><span class="pl-p">.</span><span class="pl-n">empty</span><span class="pl-p">()){</span>
        <span class="pl-kt">int</span> <span class="pl-n">u</span><span class="pl-o">=</span><span class="pl-n">q</span><span class="pl-p">.</span><span class="pl-n">top</span><span class="pl-p">().</span><span class="pl-n">u</span><span class="pl-p">;</span><span class="pl-n">q</span><span class="pl-p">.</span><span class="pl-n">pop</span><span class="pl-p">();</span>
        <span class="pl-k">if</span><span class="pl-p">(</span><span class="pl-n">vis</span><span class="pl-p">[</span><span class="pl-n">u</span><span class="pl-p">])</span> <span class="pl-k">continue</span><span class="pl-p">;</span>
        <span class="pl-n">vis</span><span class="pl-p">[</span><span class="pl-n">u</span><span class="pl-p">]</span><span class="pl-o">=</span><span class="pl-mi">1</span><span class="pl-p">;</span>
        <span class="pl-k">for</span><span class="pl-p">(</span><span class="pl-kt">int</span> <span class="pl-n">i</span><span class="pl-o">=</span><span class="pl-n">head</span><span class="pl-p">[</span><span class="pl-n">u</span><span class="pl-p">];</span><span class="pl-n">i</span><span class="pl-p">;</span><span class="pl-n">i</span><span class="pl-o">=</span><span class="pl-n">edge</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">].</span><span class="pl-n">next</span><span class="pl-p">){</span>
            <span class="pl-kt">int</span> <span class="pl-n">v</span><span class="pl-o">=</span><span class="pl-n">edge</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">].</span><span class="pl-n">to</span><span class="pl-p">;</span>
            <span class="pl-k">if</span><span class="pl-p">(</span><span class="pl-n">dis</span><span class="pl-p">[</span><span class="pl-n">v</span><span class="pl-p">]</span><span class="pl-o">&gt;</span><span class="pl-n">dis</span><span class="pl-p">[</span><span class="pl-n">u</span><span class="pl-p">]</span><span class="pl-o">+</span><span class="pl-n">edge</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">].</span><span class="pl-n">dis</span><span class="pl-p">){</span>
                <span class="pl-n">dis</span><span class="pl-p">[</span><span class="pl-n">v</span><span class="pl-p">]</span><span class="pl-o">=</span><span class="pl-n">dis</span><span class="pl-p">[</span><span class="pl-n">u</span><span class="pl-p">]</span><span class="pl-o">+</span><span class="pl-n">edge</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">].</span><span class="pl-n">dis</span><span class="pl-p">;</span>
                <span class="pl-k">if</span><span class="pl-p">(</span><span class="pl-o">!</span><span class="pl-n">vis</span><span class="pl-p">[</span><span class="pl-n">v</span><span class="pl-p">])</span> <span class="pl-n">q</span><span class="pl-p">.</span><span class="pl-n">push</span><span class="pl-p">((</span><span class="pl-n">Node</span><span class="pl-p">){</span><span class="pl-n">v</span><span class="pl-p">,</span><span class="pl-n">dis</span><span class="pl-p">[</span><span class="pl-n">v</span><span class="pl-p">]});</span>
            <span class="pl-p">}</span>
        <span class="pl-p">}</span>
    <span class="pl-p">}</span>
<span class="pl-p">}</span>

<span class="pl-kt">int</span> <span class="pl-nf">main</span><span class="pl-p">(){</span>
    <span class="pl-n">scanf</span><span class="pl-p">(</span><span class="pl-s">&quot;%d%d%d&quot;</span><span class="pl-p">,</span><span class="pl-o">&amp;</span><span class="pl-n">n</span><span class="pl-p">,</span><span class="pl-o">&amp;</span><span class="pl-n">m</span><span class="pl-p">,</span><span class="pl-o">&amp;</span><span class="pl-n">k</span><span class="pl-p">);</span>
    <span class="pl-k">for</span><span class="pl-p">(</span><span class="pl-kt">int</span> <span class="pl-n">i</span><span class="pl-o">=</span><span class="pl-mi">1</span><span class="pl-p">;</span><span class="pl-n">i</span><span class="pl-o">&lt;=</span><span class="pl-n">m</span><span class="pl-p">;</span><span class="pl-o">++</span><span class="pl-n">i</span><span class="pl-p">){</span>
        <span class="pl-n">scanf</span><span class="pl-p">(</span><span class="pl-s">&quot;%d%d%d&quot;</span><span class="pl-p">,</span><span class="pl-o">&amp;</span><span class="pl-n">u</span><span class="pl-p">,</span><span class="pl-o">&amp;</span><span class="pl-n">v</span><span class="pl-p">,</span><span class="pl-o">&amp;</span><span class="pl-n">w</span><span class="pl-p">);</span>
        <span class="pl-k">for</span><span class="pl-p">(</span><span class="pl-kt">int</span> <span class="pl-n">j</span><span class="pl-o">=</span><span class="pl-mi">0</span><span class="pl-p">;</span><span class="pl-n">j</span><span class="pl-o">&lt;=</span><span class="pl-n">k</span><span class="pl-p">;</span><span class="pl-o">++</span><span class="pl-n">j</span><span class="pl-p">){</span>
            <span class="pl-n">add</span><span class="pl-p">(</span><span class="pl-n">u</span><span class="pl-o">+</span><span class="pl-n">j</span><span class="pl-o">*</span><span class="pl-n">n</span><span class="pl-p">,</span><span class="pl-n">v</span><span class="pl-o">+</span><span class="pl-n">j</span><span class="pl-o">*</span><span class="pl-n">n</span><span class="pl-p">,</span><span class="pl-n">w</span><span class="pl-p">);</span>
            <span class="pl-n">add</span><span class="pl-p">(</span><span class="pl-n">v</span><span class="pl-o">+</span><span class="pl-n">j</span><span class="pl-o">*</span><span class="pl-n">n</span><span class="pl-p">,</span><span class="pl-n">u</span><span class="pl-o">+</span><span class="pl-n">j</span><span class="pl-o">*</span><span class="pl-n">n</span><span class="pl-p">,</span><span class="pl-n">w</span><span class="pl-p">);</span>
        <span class="pl-p">}</span>
        <span class="pl-k">for</span><span class="pl-p">(</span><span class="pl-kt">int</span> <span class="pl-n">j</span><span class="pl-o">=</span><span class="pl-mi">0</span><span class="pl-p">;</span><span class="pl-n">j</span><span class="pl-o">&lt;</span><span class="pl-n">k</span><span class="pl-p">;</span><span class="pl-o">++</span><span class="pl-n">j</span><span class="pl-p">){</span>
            <span class="pl-n">add</span><span class="pl-p">(</span><span class="pl-n">u</span><span class="pl-o">+</span><span class="pl-n">j</span><span class="pl-o">*</span><span class="pl-n">n</span><span class="pl-p">,</span><span class="pl-n">v</span><span class="pl-o">+</span><span class="pl-p">(</span><span class="pl-n">j</span><span class="pl-o">+</span><span class="pl-mi">1</span><span class="pl-p">)</span><span class="pl-o">*</span><span class="pl-n">n</span><span class="pl-p">,</span><span class="pl-n">w</span><span class="pl-o">/</span><span class="pl-mi">2</span><span class="pl-p">);</span>
            <span class="pl-n">add</span><span class="pl-p">(</span><span class="pl-n">v</span><span class="pl-o">+</span><span class="pl-n">j</span><span class="pl-o">*</span><span class="pl-n">n</span><span class="pl-p">,</span><span class="pl-n">u</span><span class="pl-o">+</span><span class="pl-p">(</span><span class="pl-n">j</span><span class="pl-o">+</span><span class="pl-mi">1</span><span class="pl-p">)</span><span class="pl-o">*</span><span class="pl-n">n</span><span class="pl-p">,</span><span class="pl-n">w</span><span class="pl-o">/</span><span class="pl-mi">2</span><span class="pl-p">);</span>
        <span class="pl-p">}</span>
    <span class="pl-p">}</span>
    <span class="pl-k">for</span><span class="pl-p">(</span><span class="pl-kt">int</span> <span class="pl-n">i</span><span class="pl-o">=</span><span class="pl-mi">0</span><span class="pl-p">;</span><span class="pl-n">i</span><span class="pl-o">&lt;</span><span class="pl-n">k</span><span class="pl-p">;</span><span class="pl-o">++</span><span class="pl-n">i</span><span class="pl-p">)</span><span class="pl-n">add</span><span class="pl-p">(</span><span class="pl-n">n</span><span class="pl-o">+</span><span class="pl-n">i</span><span class="pl-o">*</span><span class="pl-n">n</span><span class="pl-p">,</span><span class="pl-n">n</span><span class="pl-o">+</span><span class="pl-p">(</span><span class="pl-n">i</span><span class="pl-o">+</span><span class="pl-mi">1</span><span class="pl-p">)</span><span class="pl-o">*</span><span class="pl-n">n</span><span class="pl-p">,</span><span class="pl-mi">0</span><span class="pl-p">);</span>
    <span class="pl-n">Dijkstra</span><span class="pl-p">(</span><span class="pl-mi">1</span><span class="pl-p">);</span>
    <span class="pl-n">printf</span><span class="pl-p">(</span><span class="pl-s">&quot;%d</span><span class="pl-se">\n</span><span class="pl-s">&quot;</span><span class="pl-p">,</span><span class="pl-n">dis</span><span class="pl-p">[(</span><span class="pl-n">k</span><span class="pl-o">+</span><span class="pl-mi">1</span><span class="pl-p">)</span><span class="pl-o">*</span><span class="pl-n">n</span><span class="pl-p">]);</span>
    <span class="pl-k">return</span> <span class="pl-mi">0</span><span class="pl-p">;</span>
<span class="pl-p">}</span>
</cpde></pre></div>